Search in spatial scale-free networks
نویسندگان
چکیده
منابع مشابه
Search in spatial scale-free networks
We study the decentralized search problem in a family of parameterized spatial network models that are heterogeneous in node degree. We investigate several algorithms and illustrate that some of these algorithms exploit the heterogeneity in the network to find short paths by using only local information. In addition, we demonstrate that the spatial network model belongs to a class of searchable...
متن کاملRobustness of Scale-free Spatial Networks
A growing family of random graphs is called robust if it retains a giant component after percolation with arbitrary positive retention probability. We study robustness for graphs, in which new vertices are given a spatial position on the d-dimensional torus and are connected to existing vertices with a probability favouring short spatial distances and high degrees. In this model of a scale-free...
متن کاملCrossover from scale-free to spatial networks
– In many networks such as transportation or communication networks, distance is certainly a relevant parameter. In addition, real-world examples suggest that when long-range links are existing, they usually connect to hubs —the well-connected nodes. We analyze a simple model which combines both these ingredients —preferential attachment and distance selection characterized by a typical finite ...
متن کاملEfficient and scalable search on scale-free P2P networks
Unstructured peer-to-peer (P2P) systems (e.g. Gnutella) are characterized by uneven distributions of node connectivity and file sharing. The existence of “hub” nodes that have a large number of connections and “generous” nodes that share many files significantly influences performance of information search over P2P file-sharing networks. In this paper, we present a novel Scalable Peerto-Peer Se...
متن کاملGenerating small-world, scale-free, and multi-cluster spatial networks
Almost all real-world networks are distributed in space. In many of these networks, more short-than long-distance connections exist. Thus, there is a preference to minimize the length of connections. Such networks often exhibit properties of small-world, scale-free or multi-clustered networks. However, previous models for development, where only distance between nodes is considered when establi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2007
ISSN: 1367-2630
DOI: 10.1088/1367-2630/9/6/190